A Dynamic Distributed Double Guided Genetic Algorithm for Optimization and Constraint Reasoning
نویسندگان
چکیده
منابع مشابه
A New Hybrid Distributed Double Guided Genetic Swarm Algorithm for Optimization and Constraint Reasoning: Case of Max-CSPs
In this paper we propose a new distributed double guided hybrid algorithm combining the particle swarm optimization (PSO) with genetic algorithms (GA) to resolve maximal constraint satisfaction problems (Max-CSPs). It consists on a multi-agent approach inspired by a centralized version of hybrid algorithm called Genetical Swarm Optimization (GSO). Our approach consists of a set of evolutionary ...
متن کاملDynamic Distributed Constraint Reasoning
What local action can agents take, without the benefit of global knowledge, to produce the best global solution? Many dynamic distributed systems can be modeled using techniques from distributed constraint reasoning, however, existing work in the distributed constraint reasoning community does not address the true dynamism inherent in many real-
متن کاملD3G2A: A dynamic distributed double guided genetic algorithm for the case of the processors configuration problem
Within the framework of Constraint satisfaction and optimization problem (CSOP), we introduce a new optimization distributed method based on Genetic Algorithms (GA). This method consists of agents dynamically created and cooperating in order to solve the problem. Each agent performs its own GA on its own sub-population. This GA is sometimes random and sometimes guided by both the template conce...
متن کاملLoad Balancing for the Dynamic Distributed Double Guided Genetic Algorithm for MAX-CSPs
The Dynamic Distributed Double Guided Genetic Algorithm (D3G2A) deals with Maximal Constraint Satisfaction Problems. The approach consists in creating agents cooperating together to solve problems. This paper aims to improve the D3G2A. The main purpose is to balance agent loads this distributed approach. The proposed approach will redistribute the load of Species agents more equally in order to...
متن کاملProactive Dynamic Distributed Constraint Optimization
Current approaches that model dynamism in DCOPs solve a sequence of static problems, reacting to changes in the environment as the agents observe them. Such approaches thus ignore possible predictions on future changes. To overcome this limitation, we introduce Proactive Dynamic DCOPs (PD-DCOPs), a novel formalism to model dynamic DCOPs in the presence of exogenous uncertainty. In contrast to r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Research
سال: 2006
ISSN: 0974-1259
DOI: 10.5019/j.ijcir.2006.61